Turán theorems and convexity invariants for directed graphs
نویسندگان
چکیده
This paper is motivated by the desire to evaluate certain classical convexity invariants (specifically, the Helly and Radon numbers) in the context of transitive closure of arcs in the complete digraph. To do so, it is necessary to establish several new Turán type results for digraphs and characterize the associated extremal digraphs. In the case of the Radon number, we establish the following analogue for transitive closure in digraphs of Radon’s classical convexity theorem [J. Radon, Mengen konvexer Körper, die einer gemeinsamen Punkt enthalten, Math. Ann. 83 (1921) 113–115]: in a complete digraph on n 7 vertices with >n2/4 arcs, it is possible to partition the arc set into two subsets whose transitive closures have an arc in common. Published by Elsevier B.V.
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملOn triangle path convexity in graphs
Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملInequalities of extended beta and extended hypergeometric functions
We study the log-convexity of the extended beta functions. As a consequence, we establish Turán-type inequalities. The monotonicity, log-convexity, log-concavity of extended hypergeometric functions are deduced by using the inequalities on extended beta functions. The particular cases of those results also give the Turán-type inequalities for extended confluent and extended Gaussian hypergeomet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008